Generating Counterexamples for Multi-valued Model-Checking

نویسندگان

  • Arie Gurfinkel
  • Marsha Chechik
چکیده

Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model-checking, introduced in [4] is an extension of classical model-checking. Instead of classical logic, it operates on elements of a given De Morgan algebra, e.g. the Kleene algebra [14]. Multi-valued modelchecking has been used in a number of applications, primarily when reasoning about partial [2] and inconsistent [10] systems. In this paper we show how to generate counterexamples for multi-valued model-checking. We describe the proof system for a multi-valued variant of CTL, discuss how to use it to generate counterexamples. The techniques presented in this paper have been implemented as part of our symbolic multi-valued model-checker χChek [3].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Creating Büchi Automata for Multi-valued Model Checking

In explicit state model checking of linear temporal logic properties, a Büchi automaton encodes a temporal property. It interleaves with a Kripke model to form a state space, which is searched for counterexamples. Multi-valued model checking considers additional truth values beyond the Boolean true and false; these values add extra information to the model, e.g. for the purpose of abstraction o...

متن کامل

A Game-based Framework for Ctl Counterexamples and Abstraction-reenement a Game-based Framework for Ctl Counterexamples and Abstraction-reenement

Model checking is an e cient procedure that checks whether or not a given system model ful lls a desired property, described as a temporal logic formula. Yet, as real models tend to be very big, model checking encounters the state-explosion problem. One solution to this problem is the use of abstraction, that hides some of the details of the original (concrete) model. In this work we consider t...

متن کامل

Verifying Multi-Agent Systems by Model Checking Three-valued Abstractions

We develop the theoretical foundations of a predicate abstraction methodology for the verification of multi-agent systems. We put forward a specification language based on epistemic logic and a weak variant of the logic ATL interpreted on a three-valued semantics. We show that the model checking problem for multi-agent systems in this setting is tractable by giving a provably correct procedure ...

متن کامل

Generating Counterexamples for Model Checking by Transformation

Counterexamples explain why a desired temporal logic property fails to hold. The generation of counterexamples is considered to be one of the primary advantages of model checking as a verification technique. Furthermore, when model checking does succeed in verifying a property, there is typically no independently checkable witness that can be used as evidence for the verified property. Previous...

متن کامل

Incremental Construction of Counterexamples in Model Checking Web Documents

A new algorithm for incrementally generating counterexamples for the temporal description logic ALCCTL is presented. ALCCTL is a decidable combination of the description logic ALC and computation tree logic CTL that is expressive for contentand structure-related properties of web documents being verified by model checking. In the case of a specification violation, existing model checkers provid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003